UVa/11590 - Prefix lookup/iscinfastenough.cpp

   1 using namespace std;
   2 #include <algorithm>
   3 #include <iostream>
   4 #include <iterator>
   5 #include <sstream>
   6 #include <fstream>
   7 #include <cassert>
   8 #include <climits>
   9 #include <cstdlib>
  10 #include <cstring>
  11 #include <string>
  12 #include <cstdio>
  13 #include <vector>
  14 #include <cmath>
  15 #include <queue>
  16 #include <deque>
  17 #include <stack>
  18 #include <list>
  19 #include <map>
  20 #include <set>
  21
  22 template <class T> string toStr(const T &x){ stringstream s; s << x; return s.str(); }
  23 template <class T> int toInt(const T &x){ stringstream s; s << x; int r; s >> r; return r; }
  24
  25 #define For(i, a, b) for (int i=(a); i<(b); ++i)
  26 #define foreach(x, v) for (typeof (v).begin() x = (v).begin(); x != (v).end(); ++x)
  27 #define D(x) cout << #x " = " << (x) << endl
  28
  29
  30 int main(){
  31   int n, m;
  32   while (cin >> n >> m){
  33     if (n == 0 && m == 0) break;
  34     string s;
  35     for (int i=0; i<n; ++i){
  36       cin >> s;
  37     }
  38     int k;
  39     cin >> k;
  40     for (int i=0; i<k; ++i){
  41       cin >> s;
  42     }
  43   }
  44   return 0;
  45 }